Faulty fetal packing.
نویسندگان
چکیده
A male infant was born by emergency caesarean section at 34(+4) weeks for failed induction of labour. Shortly after birth a depression about the same size as the baby's fist was noted over the right parietal region. After careful consideration of the perinatal history and examination findings, the baby was diagnosed with faulty fetal packing. At 3-month follow-up, the defect had completely corrected without intervention.
منابع مشابه
On solving multi-objective bin packing problems using memetic algorithms
The bin-packing problem (BPP) and its multi-dimensional variants have many practical applications, such as packing objects in boxes, production planning, multiprocessor scheduling, etc. The classical singleobjective formulation of the two-dimensional bin packing (2D-BPP) consists of packing a set of objects (pieces) in the minimum number of bins (containers). This paper presents a new Pareto-ba...
متن کامل'Ping pong' fracture in a term infant.
1 of 2 DESCRIPTION We report a term infant born by emergency C-section for fetal bradycardia. Active labour was established at the time of section, resulting in the fetus being deeply impacted and diffi cult to extract. Baby was born pale and fl oppy but responded to infl ation breaths. Antenatal scans were unremarkable. She was noted to have a depression measuring 4×4 cm in the right parietal ...
متن کاملGaps between optimal values of some packing and scheduling problems
We consider three connected resource-constrained optimization problems: 1D bin packing (BPP), resource-constrained project scheduling (PSP), and 2D strip packing without rotation (SPP). In the context of SPP, BPP is also known as the 1D bar relaxation and PSP as the 1D contiguous relaxation. It is easy to see that SPP can be relaxed in two different ways down to a PSP: horizontal and vertical s...
متن کاملBin Packing Problem: a Linear Constant- Space -approximation Algorithm
Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algorithms have been suggested for it. It has been proven that the best algorithm for BPP has the approximation ratio of and the time order of ( ), unless = . In the current paper, a linear approximation algorithm is presented. The suggested algorithm not only has the best possible theoretical factor...
متن کاملA Graphical Visualization Tool for Analyzing the Behavior of Metaheuristic Algorithms
This paper proposes a visualization tool for analyzing the behavior of metaheuristic algorithms. It works by reproducing graphically the solutions generated in execution time. The tool was evaluated analyzing the Hybrid Grouping Genetic Algorithm for Bin Packing (HGGA_BP). It was used to solve a benchmark with 17 instances of the one dimensional Bin Packing problem (1D-BPP). The use of the visu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- BMJ case reports
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011